Datalog with integer periodicity constraints
نویسندگان
چکیده
منابع مشابه
Datalog with Integer Periodicity Constraints
In this paper we introduce a generalization of Datalog that operates on periodicity constraints over integers. We develop a closed-form bottom-up evaluation procedure for this class of constraints. We also develop a closed-form bottom-up query evaluation procedure for the class of periodic constraints combined with gap-order constraints. We provide complexity bounds for the query evaluation pro...
متن کاملLTL over integer periodicity constraints
Periodicity constraints are present in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. We introduce the logic PLTL, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. The underlying constra...
متن کاملS . Demri LTL over Integer Periodicity Constraints
Periodicity constraints are used in many logical formalisms, in fragments of Presburger LTL, in calendar logics, and in logics for access control, to quote a few examples. In the paper, we introduce the logic PLTL, an extension of Linear-Time Temporal Logic LTL with past-time operators whose atomic formulae are defined from a first-order constraint language dealing with periodicity. Although th...
متن کاملSafe Strati ed Datalog with Integer Order
Guaranteeing termination of programs on all valid inputs is important for database applications. Termination cannot be guaranteed in Stratiied Datalog with integer (gap)-order, or Datalog :;< Z , programs on generalized databases because they can express any Turing-computable function 23]. This paper introduces a restriction of Datalog :;< Z that can express only computable queries. The restric...
متن کاملA Closed-Form Evaluation for Datalog Queries with Integer (Gap)-Order Constraints
Revesz P.Z., A closed-form evaluation for datalog queries with integer (gap)-order constraints, Theoretical Computer Science 116 (1993) 117-149. We provide a generalization of Datalog based on generalizing databases by adding integer order constraints to relational tuples. For Datalog queries with integer (gap)-order constraints (denoted as Datalog<“), we show that there is a closed-form evalua...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Logic Programming
سال: 1998
ISSN: 0743-1066
DOI: 10.1016/s0743-1066(97)10008-5